ω-Computations on Turing machines
نویسندگان
چکیده
منابع مشابه
Ambiguity of ω-Languages of Turing Machines
An ω-language is a set of infinite words over a finite alphabet X . We consider the class of recursive ω-languages, i.e. the class of ω-languages accepted by Turing machines with a Büchi acceptance condition, which is also the class Σ 1 of (effective) analytic subsets of Xω for some finite alphabet X . We investigate the notion of ambiguity for recursive ωlanguages with regard to acceptance by ...
متن کاملQuantum Turing Machines Computations and Measurements
We propose a new formulation of Quantum Turing Machines, as an extension of those proposed by Bernstein and Vazirani. For this new class of Quantum Turing Machines, both finite and infinite computations are meaningful—an infinite computation does not correspond trivially to a divergent function. Moreover, we propose a natural observation protocol for the new QTMs, that does not modify the proba...
متن کاملTuring computations on ordinals
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of Gödel’s constructible universe L. This characterization can be used to prove the generalized continuum...
متن کاملBlind Turing-Machines: Arbitrary Private Computations from Group Homomorphic Encryption
Secure function evaluation (SFE) is the process of computing a function (or running an algorithm) on some data, while keeping the input, output and intermediate results hidden from the environment in which the function is evaluated. This can be done using fully homomorphic encryption, Yao's garbled circuits or secure multiparty computation. Applications are manifold, most prominently the outsou...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1978
ISSN: 0304-3975
DOI: 10.1016/0304-3975(78)90002-6